Convergence of symmetric Markov chains on Z d
نویسندگان
چکیده
For each n let Y n t be a continuous time symmetric Markov chain with state space n −1 Z d. A condition in terms of the conductances is given for the convergence of the Y n t to a symmetric Markov process Yt on R d. We have weak convergence of {Y n t : t ≤ t0} for every t0 and every starting point. The limit process Y has a continuous part and may also have jumps.
منابع مشابه
Convergence of symmetric Markov chains on Z
For each n let Y (n) t be a continuous time symmetric Markov chain with state space n −1 Z d. Conditions in terms of the conductances are given for the convergence of the Y (n) t to a symmetric Markov process Yt on R d. We have weak convergence of {Y (n) t : t ≤ t0} for every t0 and every starting point. The limit process Y has a continuous part and may also have jumps.
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملSymmetric Markov Chains on Z with Unbounded Range
We consider symmetric Markov chains on Zd where we do not assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper bounds on the transition probabilities, estimates for exit time probabilities, and certain lower bounds on the transition probabilities. We show that a uniform Harnack inequ...
متن کاملOn Computational Aspects of the Invariant Subspace Approach to Teletraac Problems and Comparisons
A large class of teletraac problems are based on Markov chains of M/G/1 and G/M/1 type, the study of which requires numerically eecient and reliable algorithms to solve the nonlinear matrix equations arising in such chains. Given A i ; i 0, a sequence of square m-by-m nonnegative matrices and A(z) = P 1 i=0 A i z i with A(1) being an irreducible stochastic matrix, these equations for M/G/1 type...
متن کامل